Sets with more differences than sums

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sets with More Sums than Differences

Let A be a finite subset of the integers or, more generally, of any abelian group, written additively. The set A has more sums than differences if |A + A| > |A − A|. A set with this property is called an MSTD set. This paper gives explicit constructions of families of MSTD sets of integers.

متن کامل

Some explicit constructions of sets with more sums than differences

We present a variety of new results on finite sets A of integers for which the sumset A + A is larger than the difference set A − A, socalled MSTD (more sums than differences) sets. First we show that there is, up to affine transformation, a unique MSTD subset of Z of size 8. Secondly, starting from some examples of size 9, we present several new constructions of infinite families of MSTD sets....

متن کامل

D ec 2 01 1 GENERALIZED MORE SUMS THAN DIFFERENCES SETS

A More Sums Than Differences (MSTD, or sum-dominant) set is a finite set A ⊂ Z such that |A+A| < |A−A|. Though it was believed that the percentage of subsets of {0, . . . , n} that are sum-dominant tends to zero, in 2006 Martin and O’Bryant [MO] proved that a positive percentage are sum-dominant. We generalize their result to the many different ways of taking sums and differences of a set. We p...

متن کامل

Sums and Differences of Correlated Random Sets

Many fundamental questions in additive number theory (such as Goldbach’s conjecture, Fermat’s last theorem, and the Twin Primes conjecture) can be expressed in the language of sum and difference sets. As a typical pair of elements contributes one sum and two differences, we expect that |A−A| > |A+A| for a finite set A. However, in 2006 Martin and O’Bryant showed that a positive proportion of su...

متن کامل

Sets characterized by missing sums and differences

A more sums than differences (MSTD) set is a finite subset S of the integers such |S + S| > |S− S|. We show that the probability that a uniform random subset of {0, 1, . . . , n} is an MSTD set approaches some limit ρ > 4.28× 10−4. This improves the previous result of Martin and O’Bryant that there is a lower limit of at least 2 × 10−7. Monte Carlo experiments suggest that ρ ≈ 4.5× 10−4. We pre...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Archiv der Mathematik

سال: 2009

ISSN: 0003-889X,1420-8938

DOI: 10.1007/s00013-009-0014-7